舰船水压场负压区的快速估算

本文给出了快速估算舰船水压场负压区的方法,得出了海底负压变化和负压持续时间的关系,并分析了负压峰值和最大负压区长度随横距的变化规律。     

某型空空导弹控制舱检测设备设计

对某型空空导弹控制舱检测设备进行了总体设计。采用8031单片机,提出各类参数的检测方案,并对系统采取了抗干扰措施。     

喀什地区女性受教育情况实证调查及对策研究

本文研究和探讨了民族地区女性受教育的现状及对策，以期促进民族地区人口素质的提高，和谐新疆的构建和全面小康社会的实现。     

对雷达的全极化欺骗干扰技术研究

分析了3种针对单极化假目标的鉴别算法，针对单极化干扰的缺陷，提出并分析了一种干扰极化测量雷达的新技术——全极化干扰，介绍了全极化干扰技术的工作原理，并详细分析了全极化干扰机关键部件的设计。     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

虚拟环境中坦克射击训练仿真系统

在作战仿真系统中,坦克是一种重要的武器仿真实体,其火力模拟常成为研究的重点.结合科研实践,采用计算机仿真技术和部分坦克实装相结合的方式,对坦克炮长在虚拟环境中的射击训练进行仿真,着重从系统设计原理、系统软件和硬件的设计与实现等方面进行系列研究.实践证明,单片机技术和汇编编程的组合运用,不仅使系统数据的采集和传输更加实时准确,而且大大提高了系统的效能比,取得较高的军事效益和经济效益.     

一种基于模糊连接度的区域生长毁伤特征提取算法

针对传统的区域生长算法在提取军事目标毁伤时,不能较好地处理毁伤区域与背景之间的模糊性,生长结果对种子点的选取敏感等问题,提出了一种基于模糊连接度的区域生长算法。算法以模糊连接度作为生长点与种子点相似度的度量,有效地保持了像素之间的模糊性,按照模糊连接度由强至弱的顺序生长,使得生长的结果对种子点的选取不敏感;采用灰度波动控制和USAN面积相结合的方式作为生长准则,在适应目标区域灰度变化的同时得到了较好的边缘定位效果。实验结果证明了算法的有效性。     

基于改进平方根UKF双向滤波的单站无源定位算法

针对单站无源定位可观测性弱、观测噪声大而导致的定位精度低、稳定性差和收敛速度慢等问题,在结合平方根无迹卡尔曼滤波(Square-Root Unscented Kalman Filter,SRUKF)以及后向平滑思想的基础上,提出了一种改进SRUKF的双向滤波算法。该算法采用Q-R分解的形式,使用误差协方差的平方根代替协方差参与递推运算,提高了算法的稳定性与运算效率。同时,该算法对状态向量进行扩维,将过程噪声与观测噪声通过非线性系统传播,降低了噪声对滤波精度的影响,并利用当前时刻滤波结果通过Rauch-Tung-Striebel(RTS)后向平滑得到再次前向滤波更高精度的起始值,提高了算法的定位精度与收敛速度。仿真结果表明,新算法在保证实时性的基础上改善了单站无源定位的性能。     

Single machine just‐in‐time scheduling problems with two competing agents

In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014     

面向大型机构的统一身份管理方法

通过借鉴自由联盟组织提出的Liberty框架,并针对该框架的结构以及身份提供者之间信任关系的建立模式进行改造,提出一种面向大型机构的新型身份管理联盟。新型的身份管理联盟比Liberty框架更加适用于具有分布性、自治性、全局性和协同性的大型机构。新型的身份管理联盟在物理结构上可看作由多个身份提供者节点组成的一棵树,其中每个身份提供者节点必须并且只能与其父节点和子节点建立信任关系,这与现实中各个大型机构的树状层级结构是完全相符的。在系统实现过程中,依托新型身份管理联盟的树状结构,并采用LDAP实现了用户认证数据的分级存储。此外还通过安全认证网关在网络层对用户的接入进行控制,从而能够同时支持B/S和C/S两类应用系统的单点登录。